Load-balanced overlay recovery scheme with delay minimisation
نویسندگان
چکیده
منابع مشابه
Load-Balanced One-hop Overlay Multipath Routing with Path Diversity
Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause...
متن کاملLoad-Balanced IP Fast Failure Recovery
As a promising approach to improve network reliability, Proactive Failure Recovery (PFR) re-routes data traffic to backup paths without waiting for the completion of routing convergence after a local link failure. However, the diverted traffic may cause congestion on the backup paths if it is not carefully split over multiple paths according to their available capacity. Existing approach assign...
متن کاملEfficient and Load-Balance Overlay Multicast Scheme with Path Diversity for Video Streaming
An overlay multicast is proposed to solve the scalability and deployment problems in IP Multicast. We propose a scheme, Topology-aware Load-balance Hierarchical Independent Tree (TLHIT), with topology-aware, load-balance and path diversity properties to improve the performance of overlay multicast. Compared to traditional methods, the proposed TLHIT constructs not only node-disjoint but also pa...
متن کاملOverlay Caching Scheme for Overlay Networks
Recent years have seen a tremendous growth of interests in streaming continuous media such as video data over the Internet. This would create an enormous increase in the demand on various server and networking resources. To minimize service delays and to reduce loads placed on these resources, we propose an Overlay Caching Scheme (OCS) for overlay networks. OCS utilizes virtual cache structures...
متن کاملBalanced Overlay Network (BON): Decentralized Load Balancing via Self-Organized Random Networks
We introduce a new load balancing paradigm, where the instantaneous in-degree distribution of a dynamic overlay network encodes the current level of free resources at each of the server/computing nodes. The allocation of a new job is executed by sampling the in-degree of nodes via a short random walk, and assigning the job to a node with the maximum in-degree (hence, the one with the most free ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of High Performance Computing and Networking
سال: 2019
ISSN: 1740-0562,1740-0570
DOI: 10.1504/ijhpcn.2019.10018077